Linear Complexity Measures of Binary Multisequences
نویسندگان
چکیده
The joint linear complexity and k error joint linear complexity of an m fold 2n periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this paper we derived an algorithm for finding the joint linear complexity of periodic binary multisequence with the help of Modified Games Chan algorithm. Here we derived the minimum value of k for which k-error joint linear complexity is strictly less than the joint linear complexity of binary m fold multisequences of period 2n and an algorithm which, given a constant c and an m fold 2n periodic binary multisequence S, computes the minimum number k of errors and the associated error multisequence needed over a period of S for bringing the joint linear complexity of S below c .
منابع مشابه
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....
متن کاملThe expected value of the joint linear complexity of periodic multisequences
Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a wellknown relationship between the linear complexity of an N -periodic sequence ...
متن کاملError Linear Complexity Measures of Binary Multisequences
In complexity measures for sequences over finite fields, such as the linear complexity and the k – error linear complexity is of great relevance to cryptology, in particular, to the area of stream ciphers. There are basically two types of requirements for suitability of a keystream generated by a stream cipher. One of the requirements is the keystream sequence must pass various statistical test...
متن کاملGeneralized Joint Linear Complexity of Linear Recurring Multisequences
The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each Nperiodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demon...
متن کاملOn the joint linear complexity profile of explicit inversive multisequences
Weprove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect. © 2004 Elsevier Inc. All rights reserved.
متن کامل